computability theory中文什么意思

可計算性理論

theory: n. 1.理論，學理，原理。 2.學說，論說 (opp. ...
computability: 可計算性; 可算性
abacus computability: 算盤可計算性
characterization of computability: 可計算性刻劃
computability logic: 可計算性邏輯

下載手機詞典可隨時隨地查詞查翻譯

例句與用法

With the use of computability theory dividing whole - word coding into two parts : writing - input coding and computational coding , an method of none keyboard mapping for spelling language is proposed
本文依據可計算性理論，提出了拼音文字非鍵盤映射編碼方法，將整詞編碼分為輸寫碼與計算碼。
The thesis consists of four sections . in section one , we introduce some background of the topic , in section two we review some basic and recent results about the structure and hierarchies of the computably enumerable degrees which are closely related to our topic - the algebraic structure of the plus cupping turing degrees , in section three , we outline the basic principles of the priority tree argument , one of the main frameworks and tools of theorem proving in computability theory , and in section four , we prove a new result concerning the algebraic structure of the plus cupping turing degrees that there exist two computably enumerable degrees a , b such that a , b ? pc , and the join a v b of a and b is high
本篇論文分為4個部分：第一部分介紹了這個領域的一些背景知識；第二部分主要回顧了前人在研究可計算枚舉度的結構和層譜時所取得的一些基本和最新結果，這些結果與我們的主題?加杯圖靈度的代數結構密切相關；在第三部分中，我們概要的描述了優先樹方法的基本原理，此方法是可計算性理論中定理證明的一個重要框架和工具；第四部分證明了一個加杯圖靈度代數結構的新結果：存在兩個可計算枚舉度a ， b ，滿足a ， b pc ，而且a和b的并a b是一個高度。

Computability theory, also called recursion theory, is a branch of mathematical logic, of computer science, and of the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since grown to include the study of generalized computability and definability.

詳細百科解釋